Oracle branching programs and Logspace versus P
نویسندگان
چکیده
منابع مشابه
On uncertainty versus size in branching programs
We propose an information-theoretic approach to proving lower bounds on the size of branching programs. The argument is based on Kraft type inequalities for the average amount of uncertainty about (or entropy of) a given input during the various stages of computation. The uncertainty is measured by the average depth of so-called ‘splitting trees’ for sets of inputs reaching particular nodes of ...
متن کاملOn P versus Np\co-np for Decision Trees and Read-once Branching Programs
It is known that if a Boolean function f in n variables has a DNF and a CNF of size N then f also has a (deterministic) decision tree of size exp O(log n log 2 N). We show that this simulation cannot be made polynomial: we exhibit explicit Boolean functions f that require deterministic trees of size exp (log 2 N) where N is the total number of monomials in minimal DNFs for f and :f. Moreover, w...
متن کاملOn Nondeterminism versus Randomness for Read-Once Branching Programs
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing machines. In this paper, we present complexity theoretic results for randomized read-once branching programs. Our main result shows that nondeterminism can be more powerful than randomness for read-once branching programs. We present a function which is computable by ...
متن کاملOn BPP versus NPcoNP for ordered read-once branching programs
We investigate the relationship between probabilistic and nondeterministic complexity classes PP BPP NP and coNP for the ordered read once branching programs OB DDs We exhibit two explicit boolean functions qn rn such that qn f gn f g belongs to BPP n NP coNP in the context of OBDDs rn f g n f g belongs to PP n BPP NP coNP in the context of OBDDs Both of these functions are not in AC
متن کاملOracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive queries to an NP oracle. This framework allows us to evaluate the precise computational complexity of model checking for some branching-time logics where it was known that the problem is NP-hard and coNP-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90017-v